Creating Boolean Functions for the Five-EPR-Pair, Single-Error-Correcting Code
نویسندگان
چکیده
In this work we consider a quantum single-error-correcting scheme derived from a oneway entanglement purification protocol in purifying one Bell state from a finite block of five Bell states. The main issue to be concerned with in the theory of the present errorcorrection is to create specific linear Boolean functions which can transform the sixteen error syndromes occurring in the error-correcting code onto their mappings so that one Bell state is corrected whenever the other four in the finite block are measured. The Boolean function is performed under the effect of its associated sequence of basic quantum unilateral and bilateral operations. Previously, the Boolean function is created in use of the Monte Carlo computer search method. We introduce here a systematic scenario for creating the Boolean function and its associated sequence of operations so that we can do the job in an analytical way without any trial and error effort. Consequently, all possible Boolean functions can in principle be created by using our method. Furthermore, for a deduced Boolean function, we can also in the spirit of our method derive its best associated sequence of operations which may contain the least number of total operations or the least number of the bilateral XOR operations alone. Some results obtained in this work show the capability of our method in creating the Boolean function and its sequence
منابع مشابه
Five-wave-packet linear optics quantum-error-correcting code
In this article we outline a method for generating linear optics circuits that encode quantum-error-correcting codes. Using this method we produce a single-error-correcting code encoding one wave packet over five which can be implemented using linear optics and feed-forward correction. This code improves on the capacity of the best known code that can be implemented using linear optics and satu...
متن کاملOn the Triple-Error-Correcting Cyclic Codes
We consider a class of 3-error-correcting cyclic codes of length 2−1 over the two-element field F2. The generator polynomial of a code of this class has zeroes α, α i +1 and α j , where α is a primitive element of the field F2m . In short, {1, 2+1, 2 +1} refers to the zero set of these codes. Kasami in 1971 and Bracken and Helleseth in 2009, showed that cyclic codes with zeroes {1, 2 + 1, 2 + 1...
متن کاملOrdered Binary Decision Diagrams and Minimal Trellises
Ordered binary decision diagrams (OBDDs) are graph-based data structures for representing Boolean functions. They have found widespread use in computer-aided design and in formal veriication of digital circuits. Minimal trellises are graphical representations of error-correcting codes that play a prominent role in coding theory. This paper establishes a close connection between these two graphi...
متن کامل(19) United States Correcting Wom Codes, Coding Strong Single and Multiple Error Correcting Wom Codes, Coding Methods and Devices Priority Claim and Reference to Related Application
Yaakobi et al. (57) ABSTRACT Preferred embodiments of the invention provide WOM cod ing methods and electronic devices With error correcting codes that provide single, double and triple error correction. Preferred codes of the invention also the following property: if the code corrects tWo/three errors it has tWo/three parts of redundancy bits. For double error correction, if only one part of t...
متن کاملOrdered Binary Decision Diagrams and Minimal Trellises John La erty
Ordered binary decision diagrams (OBDDs) are graph-based data structures for representing Boolean functions. They have found widespread use in computer-aided design and in formal veri cation of digital circuits. Minimal trellises are graphical representations of error-correcting codes that play a prominent role in coding theory. This paper establishes a close connection between these two graphi...
متن کامل